Correction to "Achieving the Welch Bound With Difference Sets"

نویسندگان

  • Pengfei Xia
  • Shengli Zhou
  • Georgios B. Giannakis
چکیده

P. Xia was with the the Department of Electrical and Computer Engineering, University of Minnesota, and is now with Samsung Information System America, 75 West Plumeria Drive, San Jose, CA 95134 (email: [email protected]). S. Zhou is with the Department of Electrical and Computer Engineering, University of Connecticut, 371 Fairfield Road U-2157, Storrs, Connecticut 06269, USA (email: [email protected]). G. B. Giannakis is with the Department of Electrical and Computer Engineering, University of Minnesota, 200 Union Street SE, Minneapolis, Minnesota 55455, USA (email: [email protected]).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Codebooks from almost difference sets

In direct spread CDMA systems, codebooks meeting the Welch bounds are used to distinguish among the signals of different users. Recently, constructions of codebooks with difference sets meeting Welch’s bound on the maximum cross-correlation amplitude were developed. In this paper, a generic construction of codebooks using almost difference sets is considered and several classes of codebooks nea...

متن کامل

Meeting the Welch Bound with Equality

A signal set whose root-mean-square inner product magnitude equals the Welch lower bound is called a WBE signal set. WBE signal sets are of interest in synchronous CDMA communication systems. This chapter surveys the known results on WBE signal sets and extends them in several ways. In particular, WBE signal sets over signal alphabets whose size is a prime power (the most important case is the ...

متن کامل

Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets

The Welch lower bound on the total-squared-correlation (TSC) of binary signature sets is loose for binary signature sets whose length L is not a multiple of 4. Recently Karystinos and Pados developed new bounds that are better than the Welch bound in those cases, and showed how to achieve the bounds with modiied Hadamard matrices except in a couple of cases. In this paper, we study the open cases.

متن کامل

Generalized Baum-Welch and Viterbi Algorithms Based on the Direct Dependency among Observations

The parameters of a Hidden Markov Model (HMM) are transition and emission probabilities‎. ‎Both can be estimated using the Baum-Welch algorithm‎. ‎The process of discovering the sequence of hidden states‎, ‎given the sequence of observations‎, ‎is performed by the Viterbi algorithm‎. ‎In both Baum-Welch and Viterbi algorithms‎, ‎it is assumed that...

متن کامل

Lower Bounds on the Maximum Periodic and Aperiodic Correlation of Signal Sets with Arbitrary Energy Distribution

THIS IS AN UPDATED VERSION OF THE ORIGINAL PAPER Welch and Sidelnikov have obtained lower bounds on the maximum nontrivial correlations of complex signal sets constrained to have uniform signal energy. These results have long been used as a benchmark for testing the merit of signal sets, e.g., in the design of good CDMA sequence families. The Welch lower bound is generalized here to allow for a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2006